A Proposal Algorithm to Solve Delay Constraint Least Cost Optimization Problem
نویسندگان
چکیده
Traditionally, path selection within routing is formulated as a shortest optimization problem. The objective function for could be any one variety of parameters such number hops, delay, cost...etc. problem least cost delay constraint studied in this paper since very common requirement many multimedia applications and minimization captures the need todistribute network. So an iterative algorithm proposed to solve It appeared from results applying that it gave optimal (optimal solution) among multiple feasible paths (feasible solutions).
منابع مشابه
A Novel Hybrid Whale Optimization Algorithm to Solve a Production-Distribution Network Problem Considering Carbon Emissions
Nowadays, there is a great deal of attention for regulations of carbon emissions to enforce the decision-makers of production and distribution networks to redesign their systems satisfactorily. The literature has seen a rapid interest in developing novel metaheuristics to solve this problem as a complicated optimization problem. Such difficulties motivate us to address a production-distribution...
متن کاملA Scalable Algorithm to Solve Distributed Constraint Optimization
Recently, Distributed Constraint Optimization Problems (DCOP) have been drawing a growing body of attention as an important research area in multi agent systems as a large body of real problems can be modeled by them. The primary goal of this research is to design a distributed and effective algorithm to solve DCOP. There are various criteria that measure the efficiency of DCOP algorithms, but ...
متن کاملA Honey Bee Algorithm To Solve Quadratic Assignment Problem
Assigning facilities to locations is one of the important problems, which significantly is influence in transportation cost reduction. In this study, we solve quadratic assignment problem (QAP), using a meta-heuristic algorithm with deterministic tasks and equality in facilities and location number. It should be noted that any facility must be assign to only one location. In this paper, first o...
متن کاملEvolutionary bacterial foraging algorithm to solve constraint numerical optimization problems
A version of Modified Bacterial Foraging Optimization Algorithm to solve Constraints Numerical Optimization is tested. The proposal uses mutation operator, skew mechanism and local search operator. To prove the effectiveness of the mechanism and adaptations proposed, 24 well-known test problems are solved along set experiments. Performance measures are used for validating results obtained by th...
متن کاملA selection function based distributed algorithm for delay-constraint least-cost unicast routing
each network node and is always able to find a loop-free path satisfying the delay bound if such paths exist. Simulation study shows that the SF-DCLC is not as sensitive to the delay bound and network size as some other DCLC routing algorithms, and attains very low cost-inefficiency (less than 3% to the optimal one) in various network scenarios we simulate. The most attractive feature of SF-DCL...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Ma?allat? al-handasat?
سال: 2023
ISSN: ['1726-4073', '2520-3339']
DOI: https://doi.org/10.31026/j.eng.2013.01.09